Fault-Tolerant Graphs for Tori
نویسندگان
چکیده
Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and a graph H , construct a graph G from H by adding a minimum number D( t , H ) of edges such that even after deleting any t edges from G the remaining graph contains H as a subgraph. We estimate D( t , H ) for the torus, which is well known as a very important interconnection network for multiprocessor systems. q 1998 John Wiley & Sons, Inc. Networks 32:
منابع مشابه
Faithful 1-Edge Fault Tolerant Graphs
A graph G* is l-edge fault tolerant with respect to a graph G, denoted by I-EFT( G), if any graph obtained by removing an edge from G’ contains G. A l-Em(G) graph is said to be optimal if it contains the minimum number of edges among all I-EFT( G) graphs. Let Gf be 1 -EJ!T( Gi) for i = 1,2. It can be easily verified that the Cartesian product graph G; x G; is l-edge fault tolerant with respect ...
متن کاملFault-tolerant meshes with minimal numbers of spares
This paper presents several techniques for adding fault-tolerance t o distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tolerant graph with n + k nodes such that given any set of k or fewer faulty nodes, the remaining graph is guaranteed to contain the target graph as a fault-free subgraph. As a result, any algorithm designed for the targ...
متن کاملFault-tolerant graphs for hypercubes and tori
Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and graph H, construct a graph G from H by adding a minimum number A(t, H) of edges such that even after deleting any t edges from G the remaining graph contains H as a subgraph. We estimate A(t, H) for the hypercube and torus, which are well-...
متن کاملFault-Tolerant Meshes and Tori Embedded in a Faulty Supercube
Hypercubes, meshes, and tori are well known interconnection networks for parallel computing. The Supercube network is a generalization of the hypercube. The main advantage of this network is that it has the same connectivity and diameter as that of the hypercube without the constraint that the number of nodes be a power of 2. This paper proposes novel algorithms of fault-tolerant meshes and tor...
متن کاملAnalyzing Software Component Graphs of Grid Middleware: Hint to Performance Improvement
An ACO Inspired Strategy to Improve Jobs Scheduling in a Grid Environment p. 30 Architecture Aware Partitioning Algorithms p. 42 A Simple and Efficient Fault-Tolerant Adaptive Routing Algorithm for Meshes p. 54 Deadlock-Free Adaptive Routing in 2D Tori with a New Turn Model p. 58 Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph p. 70 Fault Tolerance in the Biswapped Network ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 32 شماره
صفحات -
تاریخ انتشار 1996